Queries on Voronoi diagrams of moving points
نویسندگان
چکیده
منابع مشابه
Queries on Voronoi Diagrams of Moving Points
Suppose we are given n moving postmen described by their motion equations p i (t) = s i + v i t; i = 1; : : : ; n, where s i 2 I R 2 is the position of the i'th postman at time t = 0, and v i 2 I R 2 is his velocity. The problem we address is how to preprocess the postmen data so as to be able to eeciently answer two types of nearest-neighbor queries. The rst one asks who is the nearest postman...
متن کاملVoronoi Diagrams of Moving Points
Consider a set of n points in d-dimensional Euclidean space, d 2, each of which is continuously moving along a given individual trajectory. At each instant in time, the points deene a Voronoi diagram. As the points move, the Voronoi diagram changes continuously, but at certain critical instants in time, topological events occur that cause a change in the Voronoi diagram. In this paper, we prese...
متن کاملRevenge of the Dog: Queries on Voronoi Diagrams of Moving Points
Suppose we are given n moving postmen described by their motion equations pi(t) = si + vit; i = 1; : : : ; n, where si 2 IR 2 is the position of the i'th postman at time t = 0, and vi 2 IR 2 is his velocity. The problem we address is how to preprocess the postmen data so as to be able to e ciently answer two types of nearest neighbor queries. The rst one asks \who is the nearest postman at time...
متن کاملVoronoi Diagrams of Moving Points in the Plane
The combinatorial complexities of (1) the Voronoi diagram of moving points in 2D and (2) the Voronoi diagram of lines in 3D, both under the Euclidean metric, continues to challenge geometers because of the open gap between the (n2) lower bound and the O(n3+ε) upper bound. Each of these two combinatorial problems has a closely related problem involving Minkowski sums: (1′) the complexity of a Mi...
متن کاملProbabilistic Voronoi Diagrams for Probabilistic Moving Nearest Neighbor Queries
Article history: Received 9 November 2010 Received in revised form 4 February 2012 Accepted 6 February 2012 Available online 21 February 2012 A large spectrum of applications such as location based services and environmental monitoring demand efficient query processing on uncertain databases. In this paper, we propose the probabilistic Voronoi diagram (PVD) for processing moving nearest neighbo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1996
ISSN: 0925-7721
DOI: 10.1016/0925-7721(95)00053-4